Fast algorithms for histogram matching: Application to texture synthesis
نویسندگان
چکیده
منابع مشابه
Pyramid-based texture synthesis using local orientation and multidimensional histogram matching
One very influential method for texture synthesis is based on the steerable pyramid by alternately imposing marginal statistics on the image and the pyramid’s subbands. In this work, we investigate two extensions to this framework. First, we exploit the steerability of the transform to obtain histograms of the subbands independent of the local orientation; i.e., we select the direction of maxim...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملAntipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic process of a wide class of real texture images. This is realized through a new data structure the Antipole Tree and a suitable research strategy able to outperform both the classical linear full-search heuristic and the TSV...
متن کاملFast three-dimensional Texture Synthesis
Three-dimensional (3D) textures are popular for texturing solid objects. They usually achieve superior results over conventional two-dimensional (2D) texture mapping techniques. However, whereas 2D textures can be obtained using for example a photograph, capturing or generating solid textures is not straightforward. Procedural techniques can replicate some types of materials, but are usually di...
متن کاملFast Algorithms for Exact String Matching
Given a pattern string P of length n and a query string T of length m, where the characters of P and T are drawn from an alphabet of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present algorithms that in O(n∆) time preprocess P to essentially identify sparse(P ), a rarely occurring substring of P , and then use it to find occurr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electronic Imaging
سال: 2000
ISSN: 1017-9909
DOI: 10.1117/1.482725